Model-Based Verification: Abstraction Guidelines

نویسندگان

  • John Hudak
  • Santiago Comella-Dorda
  • David P. Gluch
  • Grace Lewis
  • Chuck Weinstock
چکیده

ion is used to reduce the complexity of a model by including only the parts of the system necessary for the issues being investigated. The goal of abstraction is to prune away unnecessary detail. This enables the modeler to explore, substantiate, or disprove intended behaviors of a system while maintaining the validity of the model [Frantz 95]. Engineers and scientists routinely use abstraction in problem solving. This section of the technical note presents some abstraction techniques and relevant examples. The techniques discussed are: • variable elimination • enumeration • reduction • non-determinism • grouping based on commonalities • decomposition Various stages of abstraction and modeling of a system are generally referred to as being representative of a ‘level of abstraction.’ The convention for these levels is that the removal of detail results in a higher level of abstraction whereas adding detail results in a lower level of abstraction. The term ‘granularity’ is often used to refer to the level of detail. Levels of abstraction and levels of granularity are often used interchangeably. Variable elimination [Heitmeyer 98, Bharadwaj 99] removes parts of the system that are not relevant to the properties and behavior to be demonstrated or proven. Irrelevant variables can be identified by looking at dependencies and then removed. Again, consider a process control computer system and its applications software. Let’s assume we are investigating the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of a Quality Management Theory: Using a Delphi Study

Background A model of quality management called Strategic Collaborative Quality Management (SCQM) model was developed based on the quality management literature review, the findings of a survey on quality management assessment in healthcare organisations, semi-structured interviews with healthcare stakeholders, and a Delphi study on healthcare quality management experts. The purpose of this stu...

متن کامل

Action Relations. Basic Design Concepts for Behaviour Modelling and Refinement

ion level n+2 abstraction level n+1 1.2 Design methodology 7 ping of the design model and its design notation onto a formal model is called the formal semantics of the design model and its design notation, respectively. In this way, the formal model allows the use of mathematical models to compare, analyse and manipulate designs. Section 2.3 elaborates on the relationships between a design mode...

متن کامل

Advances in counterexample-guided abstraction refinement

This report is a collection of six articles on model checking in the abstraction/refinement framework. This framework is used by various techniques for tackling the state-space explosion problem that is frequently encountered in model checking. The articles collected in this report are (in order of appearance): 1. Counterexample-guided abstraction refinement. Clarke, Grumberg, Jha, Lu, Veith[2]...

متن کامل

System-on-a-chip (soc) Verification Methods

The advent of system-on-a-chip (SoC) technology is a result of ever increasing transistor density. Unfortunately, this means that verification will pose the greatest problem to design because difficulties in verification scale faster than transistor technology. This paper provides evidence of this effect by citing industry trends, as well as discusses the potential pitfalls in SoC verification....

متن کامل

Verifying Absence of ∞ Loops in Parameterized Protocols

ion An abstract version of a program is a “simplification” of the program, with less “detail”. As such, it over-approximates the behavior of the program. The point of abstraction is to simplify the verification, by obtaining a simpler program from which we can draw conclusions about the original system [CC77, Sif84, CGL92, LGS95, KP00]. Many techniques based on abstraction compute an over-appro...

متن کامل

Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs

Higher-order model checking has been recently applied to automated verification of higher-order functional programs, but there have been difficulties in dealing with algebraic data types such as lists and trees. To remedy the problem, we propose an automata-based abstraction of tree data, and a counterexample-guided refinement of the abstraction. By combining them with higher-order model checki...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002